منابع مشابه
A Polya Operator for Automorphic L-functions
Let k be a number field and letM be a simple k-algebra with center k of rank n, i.e. dimk(M) = n 2. Fix a k-involution x 7→ xτ on M , i.e. (xy)τ = yτxτ as well as (xτ )τ = x and xτ = x when x ∈ k. We will assume that M and τ are defined over the ring of integers O of k. The standard example will be the algebra of n× n matrices Matn(k) and x τ = xt the transposed matrix. For any ringR over k let...
متن کاملPerformance of the Viterbi Algorithm on a Polya Channel
The Performance of the Viterbi algorithm with a new Polya contagion noise process is analyzed. The markov channel is the memory channel usually studied in the bibliography. The Polya channel was introduced years ago as a special case of a memory channel. In this work, the Polya contagion scheme is considered as a noise process and a GaussPolya noise model is introduced this way in order to perf...
متن کاملthe algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولAn Algorithm for L∞ Approximation by Step Functions
We give an algorithm for determining an optimal step function approximation of weighted data, where the error is measured with respect to the L∞ norm. The algorithm takes Θ(n+ log n · b(1 + log n/b)) time and Θ(n) space, where b is the number of steps. Thus the time is Θ(n log n) in the worst case and Θ(n) when b = O(n/ log n log log n). A minor change determines the optimal reduced isotonic re...
متن کاملAn Approximation Algorithm for l∞-Fitting Robinson Structures to Distances
In this paper, we present a factor 16 approximation algorithm for the following NP-hard distance fitting problem: given a finite set X and a distance d on X, find a Robinsonian distance dR on X minimizing the l∞-error ||d−dR||∞ = maxx,y∈X{|d(x, y)− dR(x, y)|}. A distance dR on a finite set X is Robinsonian if its matrix can be symmetrically permuted so that its elements do not decrease when mov...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Approximation Theory
سال: 1983
ISSN: 0021-9045
DOI: 10.1016/0021-9045(83)90129-6